InforLorV4, Main, Exploration, bibRecord, 003877

Unification Modulo Homomorphic Encryption

Identifieur interne : 003877 ( Main/Exploration ); précédent : 003876; suivant : 003878

Unification Modulo Homomorphic Encryption

Auteurs : Siva Anantharaman [France] ; Hai Lin [États-Unis] ; Christopher Lynch [États-Unis] ; Paliath Narendran [États-Unis] ; Michaël Rusinowitch [France]

Source :

Lecture Notes in Computer Science [ 0302-9743 ]

RBID : ISTEX:29A41362081F471FC3397C57722B6C7BB8D0B89C

Abstract

Abstract: Encryption ‘distributing over pairs’ is a technique employed in several cryptographic protocols. We show that unification is decidable for an equational theory HE specifying such an encryption. The method consists in transforming any given problem in such a way, that the resulting problem can be solved by combining a graph-based reasoning on its equations involving the homomorphisms, with a syntactic reasoning on its pairings. We show HE-unification to be NP-hard and in NEXPTIME.

Url:

DOI: 10.1007/978-3-642-04222-5_6

Affiliations:

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Unification Modulo Homomorphic Encryption</title>
<author><name sortKey="Anantharaman, Siva" sort="Anantharaman, Siva" uniqKey="Anantharaman S" first="Siva" last="Anantharaman">Siva Anantharaman</name>
</author>
<author><name sortKey="Lin, Hai" sort="Lin, Hai" uniqKey="Lin H" first="Hai" last="Lin">Hai Lin</name>
</author>
<author><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name>
</author>
<author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:29A41362081F471FC3397C57722B6C7BB8D0B89C</idno>
<date when="2009" year="2009">2009</date>
<idno type="doi">10.1007/978-3-642-04222-5_6</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-FBJR6F2C-S/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000967</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000967</idno>
<idno type="wicri:Area/Istex/Curation">000961</idno>
<idno type="wicri:Area/Istex/Checkpoint">000984</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000984</idno>
<idno type="wicri:doubleKey">0302-9743:2009:Anantharaman S:unification:modulo:homomorphic</idno>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00426798</idno>
<idno type="url">https://hal.inria.fr/inria-00426798</idno>
<idno type="wicri:Area/Hal/Corpus">005045</idno>
<idno type="wicri:Area/Hal/Curation">005045</idno>
<idno type="wicri:Area/Hal/Checkpoint">002A37</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">002A37</idno>
<idno type="wicri:Area/Main/Merge">003955</idno>
<idno type="wicri:Area/Main/Curation">003877</idno>
<idno type="wicri:Area/Main/Exploration">003877</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Unification Modulo Homomorphic Encryption</title>
<author><name sortKey="Anantharaman, Siva" sort="Anantharaman, Siva" uniqKey="Anantharaman S" first="Siva" last="Anantharaman">Siva Anantharaman</name>
<affiliation></affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
<author><name sortKey="Lin, Hai" sort="Lin, Hai" uniqKey="Lin H" first="Hai" last="Lin">Hai Lin</name>
<affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Clarkson University, Potsdam, NY</wicri:regionArea>
<placeName><region type="state">État de New York</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name>
<affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Clarkson University, Potsdam, NY</wicri:regionArea>
<placeName><region type="state">État de New York</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name>
<affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country>
<wicri:regionArea>University at Albany-SUNY</wicri:regionArea>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country>
</affiliation>
</author>
<author><name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
<affiliation></affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">France</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Encryption ‘distributing over pairs’ is a technique employed in several cryptographic protocols. We show that unification is decidable for an equational theory HE specifying such an encryption. The method consists in transforming any given problem in such a way, that the resulting problem can be solved by combining a graph-based reasoning on its equations involving the homomorphisms, with a syntactic reasoning on its pairings. We show HE-unification to be NP-hard and in NEXPTIME.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
<li>États-Unis</li>
</country>
<region><li>État de New York</li>
</region>
</list>
<tree><country name="France"><noRegion><name sortKey="Anantharaman, Siva" sort="Anantharaman, Siva" uniqKey="Anantharaman S" first="Siva" last="Anantharaman">Siva Anantharaman</name>
</noRegion>
<name sortKey="Rusinowitch, Michael" sort="Rusinowitch, Michael" uniqKey="Rusinowitch M" first="Michaël" last="Rusinowitch">Michaël Rusinowitch</name>
</country>
<country name="États-Unis"><region name="État de New York"><name sortKey="Lin, Hai" sort="Lin, Hai" uniqKey="Lin H" first="Hai" last="Lin">Hai Lin</name>
</region>
<name sortKey="Lin, Hai" sort="Lin, Hai" uniqKey="Lin H" first="Hai" last="Lin">Hai Lin</name>
<name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name>
<name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name>
<name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name>
<name sortKey="Narendran, Paliath" sort="Narendran, Paliath" uniqKey="Narendran P" first="Paliath" last="Narendran">Paliath Narendran</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003877 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003877 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:29A41362081F471FC3397C57722B6C7BB8D0B89C
   |texte=   Unification Modulo Homomorphic Encryption
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

Serveur d'exploration sur la recherche en informatique en Lorraine

Unification Modulo Homomorphic Encryption

Unification Modulo Homomorphic Encryption

Source :

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.